Generation of the ford sequence of length 2n, n large
نویسندگان
چکیده
منابع مشابه
analysis of reading comprehension needs of the students of paramedical studies: the case of the students of health information management (him)
چکیده ندارد.
15 صفحه اولSTATISTICAL PREDICTION OF THE SEQUENCE OF LARGE EARTHQUAKES IN IRAN
The use of different probability distributions as described by the Exponential, Pareto, Lognormal, Rayleigh, and Gama probability functions applied to estimation the time of the next great earthquake (Ms≥6.0) in different seismotectonic provinces of Iran. This prediction is based on the information about past earthquake occurrences in the given region and the basic assumption that future seismi...
متن کاملthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Carmichael numbers in the sequence (2n k+1)n≥1
A Carmichael number is a positive integer N which is composite and the congruence aN ≡ a (mod N) holds for all integers a. The smallest Carmichael number is N = 561 and was found by Carmichael in 1910 in [6]. It is well– known that there are infinitely many Carmichael numbers (see [1]). Here, we let k be any odd positive integer and study the presence of Carmichael numbers in the sequence of ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1972
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90091-x